package wh.对称二叉树;

/**
 * @author: wh(1835734390 @ qq.com)
 * @date: 2022/3/31 21:09
 * @description:定义一个二叉树节点
 * @version:
 */

public class TreeNode {
  int val;
  TreeNode left;
  TreeNode right;
  TreeNode() {}
  TreeNode(int val) { this.val = val; }
  TreeNode(int val, TreeNode left, TreeNode right) {
      this.val = val;
      this.left = left;
      this.right = right;
  }
}

